Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
501	zn poly: a library for polynomial arithmetic David Harvey, New York University January 8, 2009 David Harvey, New York University Add to Reading List Source URL: web.maths.unsw.edu.au Language: English - Date: 2011-07-17 23:06:27 Polynomials Computational number theory Computational complexity theory Algebra Digital signal processing Fast Fourier transform Fast Library for Number Theory Time complexity Multiplication Mathematics Abstract algebra Theoretical computer science
502	CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Largest empty rectangle Algorithm Closest pair of points problem Reduction Computer science Computational geometry Beta skeleton Mathematics Applied mathematics Computational complexity theory
503	Richard Ryan Williams Computer Science Department Stanford University, Stanford, CAEmail: EDUCATION Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-09-18 23:56:44 ACM SIGACT Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Ryan Williams Symposium on Foundations of Computer Science Computational complexity theory SWAT and WADS conferences Algorithm Symposium on Parallelism in Algorithms and Architectures Theoretical computer science Computer science Applied mathematics
504	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
505	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics
506	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
507	Algorithmica:1-10 Algorithmica 9 1990Springer-VerlagNew York Inc. An Improved Parallel Algorithm for Integer GCD Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2011-02-28 05:21:13 Computational complexity theory Greatest common divisor Euclidean algorithm Number theory Time complexity Factorial Binary GCD algorithm Computational complexity of mathematical operations Mathematics Theoretical computer science Multiplicative functions
508	On the Complexity of Asynchronous Gossip Chryssis Georgiou Seth Gilbert Dept. of Computer Science, Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2008-08-26 04:43:06 Analysis of algorithms Fault-tolerant computer systems Consensus Gossip protocol Randomized algorithm Distributed computing Time complexity Gossip Theoretical computer science Computational complexity theory Applied mathematics
509	Ad-Hoc Aggregations of Ranked Lists in the Presence of Hierarchies Nilesh Bansal Sudipto Guha Add to Reading List Source URL: www.blogscope.net Language: English - Date: 2012-04-10 15:02:30 Algorithm Mathematical logic Hierarchy PP Randomized algorithm NP Information retrieval Theoretical computer science Computational complexity theory Applied mathematics
510	On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 21:09:14 NP-complete problems Exponential time hypothesis Conjunctive normal form Boolean satisfiability problem Vertex cover Set cover problem Time complexity Graph coloring Independent set Theoretical computer science Computational complexity theory Applied mathematics

UPDATE